import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 强仔
 * Date: 2022-07-05
 * Time: 16:15
 */
public class Main {
    public static void main1(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        String[] array = new String[n + 1];
        for (int i = 0; i < n + 1; i++) {
            array[i] = scanner.nextLine();
        }

        // 判断是否符合字典序排序
        boolean isDir = true;
        for (int i = 2; i < n + 1; i++) {
            if(array[i].compareTo(array[i - 1]) < 0){
                isDir = false;
                break;
            }
        }

        // 判断是否符合长度排序
        boolean isLen = true;
        for (int i = 2; i < n + 1; i++) {
            if(array[i].length() - array[i - 1].length() < 0){
                isLen = false;
                break;
            }
        }

        if(isDir && isLen){
            System.out.println("both");
        }
        if(isDir && !isLen){
            System.out.println("lexicographically");
        }
        if(!isDir && isLen){
            System.out.println("lengths");
        }
        if(!isDir && !isLen){
            System.out.println("none");
        }
    }


    // 求最小公倍数
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int min = Math.min(a,b);
        int max = Math.max(a,b);
        int result = min * max;

        for (int i = 1; i <= min; i++) {
            int value = i * max;
            if(value % min == 0 && value % max == 0){
                result = value;
                break;
            }
        }

        System.out.println(result);
    }
    
}
